Refine your search
Collections
Co-Authors
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Ramesh Kumar, P.
- Watermarking Algorithm Using Sobel Edge Detection
Abstract Views :115 |
PDF Views:0
Authors
Affiliations
1 Department of Computer Science and Engineering, V.R.Siddhartha Engineering College, Vijayawada, IN
1 Department of Computer Science and Engineering, V.R.Siddhartha Engineering College, Vijayawada, IN
Source
International Journal of Advanced Networking and Applications, Vol 2, No 5 (2011), Pagination: 861-867Abstract
Digital Watermarking is a process of embedding information into a digital signal. The efficiency of the watermarking process depends on the protection of visually significant information. For that we embed the watermark transparently at the edges of digital image where deformation is less identifiable. To identify the edges we used Sobel edge detection algorithm since it is inexpensive in terms of computations and on the other hand, the gradient approximation which it produces is relatively crude, in particular for high frequency variations in the image.Keywords
Watermarking, Wavelet Transform, Edge Detection.Full Text
- Secured Rekeying in B-Tree and NSBHO Tree
Abstract Views :126 |
PDF Views:0
Authors
Affiliations
1 Department of Computer Science and Engineering, V.R.Siddhartha Engineering College, Vijayawada, IN
1 Department of Computer Science and Engineering, V.R.Siddhartha Engineering College, Vijayawada, IN
Source
International Journal of Advanced Networking and Applications, Vol 1, No 2 (2009), Pagination: 131-140Abstract
Many emerging Web and Internet applications are based on a group communication model. Securing group communication is an important Internet design issue. A Key Graph approach has been used to implement the group key management and it is used to provide secure group communication. The group key management can be done in two ways: 1. Individual rekeying 2. Batch rekeying. Individual Rekeying is the process of rekeying after each join or leave request. The problem with individual rekeying is inefficiency and out-of-sync problem between keys and data. A batch rekeying using MARKING ALGORITHM can overcome the problems faced in the individual rekeying. The paper applies Batch rekeying by Marking Algorithm on the B-Tree (2-3 trees) and NSBHO (Non Splitting Balancing Higher Order) tree. The Analyzing done on the key server’s processing cost for batch rekeying in B-Tree and NSBHO tree. The proposed NSBHO (Non-Split Balancing High-Order) tree in which balancing tree after member joining does not involve node splitting. The implementation shows that the NSBHO tree has better average-case rekeying performance and far superior worst-case rekeying performance than a B-tree.Keywords
Balanced Tree, Dynamic Group, Group Key Management, High-Order Tree, Secure Multicast.Full Text